Error Bounds for Degenerate Cone Inclusion Problems
نویسندگان
چکیده
Error bounds for cone inclusion problems in Banach spaces are established under conditions weaker than Robinson’s constraint qualification. The results allow the cone to be more general than the origin and therefore also generalize a classical error bound result concerning equality-constrained sets in optimization. Applications in finite-dimensional differentiable inequalities and in tangent cones are discussed.
منابع مشابه
Verifiable and computable performance analysis of sparsity recovery
In this paper, we develop verifiable and computable performance analysis of sparsity recovery. We define a family of goodness measures for arbitrary sensing matrices as a set of optimization problems, and design algorithms with a theoretical global convergence guarantee to compute these goodness measures. The proposed algorithms solve a series of second-order cone programs, or linear programs. ...
متن کاملError bounds for symmetric cone complementarity problems
In this paper, we investigate the issue of error bounds for symmetric cone complementarity problems (SCCPs). In particular, we show that the distance between an arbitrary point in Euclidean Jordan algebra and the solution set of the symmetric cone complementarity problem can be bounded above by some merit functions such as FischerBurmeister merit function, the natural residual function and the ...
متن کاملA weighted least squares finite element method for elliptic problems with degenerate and singular coefficients
We consider second order elliptic partial differential equations with coefficients that are singular or degenerate at an interior point of the domain. This paper presents formulation and analysis of a novel weighted-norm least squares finite element method for this class of problems. We propose a weighting scheme that eliminates the pollution effect and recovers optimal convergence rates. Theor...
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملQuasi-norm Error Bounds for the Nite Element Approximation of a Non-newtonian Ow
We consider the nite element approximation of a non-Newtonian ow, where the viscosity obeys a general law including the Carreau or power law. For suuciently regular solutions we prove energy type error bounds for the velocity and pressure. These bounds improve on existing results in the literature. A key step in the analysis is to prove abstract error bounds initially in a quasi-norm, which nat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 30 شماره
صفحات -
تاریخ انتشار 2005